Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation
نویسنده
چکیده
In what case do you like reading so much? What about the type of the live data structures in logic programs derivation by means of abstract interpretation book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story book, and other entertaining books become so popular this day. Besides, the scientific books will also be the best reason to choose, especially for the students, teachers, doctors, businessman, and other professions who are fond of reading.
منابع مشابه
Verifying Partial Correctness of Logic Programs with Delay Declarations
In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It diiers from the deenition of SLD-derivation since more instantiated general uniiers are computed instead of standard mgus. The contribution of this paper follows from the observation that the derivations of logic programs ...
متن کاملPolymorphic Type Analysis in Logic Programs by Abstract Intepretation
interpretation frameworks. It is also fully automated in that its only inputs are theprogram to be analysed and type de nitions for the function symbols in the program.References[1] H. Azzoune. Type inference in Prolog. In E. Lusk and R. Overbeek, editors, Proceedingsof the ninth International Conference on Automated Deduction, pages 258{277, Argonne,Illinois, USA, May 23-26...
متن کاملOn Decision Procedures for Set-Valued Fields
An important feature of object-oriented programming languages is the ability to dynamically instantiate user-defined container data structures such as lists, trees, and hash tables. Programs implement such data structures using references to dynamically allocated objects, which allows data structures to store unbounded numbers of objects, but makes reasoning about programs more difficult. Reaso...
متن کاملAssertion based Inductive Verification Methods for Logic Programs
This paper is an overview of our results on the application of abstract interpretation concepts to the derivation of a verification method for logic programs. These include the systematic design of semantics modeling various proof methods and the characterization of assertions as abstract domains. We first apply the verification framework defined in [5] to derive inductive sufficient conditions...
متن کاملA WAM-based implementation for Composition of Logic Programs
The main aim of this paper is to show an abstract machine for compiling logic programs composed by means of meta-operators; in particular, we deal with union, intersection and closure, which are directly supported by the most common abstract machine for logic programming: the Warren Abstract Machine. The proposed solution is a mix of the interpretation-oriented and the compilation-oriented appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 675 شماره
صفحات -
تاریخ انتشار 1993